全文获取类型
收费全文 | 3079篇 |
免费 | 29篇 |
国内免费 | 50篇 |
专业分类
化学 | 70篇 |
力学 | 83篇 |
综合类 | 29篇 |
数学 | 2746篇 |
物理学 | 230篇 |
出版年
2024年 | 2篇 |
2023年 | 10篇 |
2022年 | 20篇 |
2021年 | 17篇 |
2020年 | 41篇 |
2019年 | 12篇 |
2018年 | 20篇 |
2017年 | 36篇 |
2016年 | 51篇 |
2015年 | 49篇 |
2014年 | 126篇 |
2013年 | 165篇 |
2012年 | 166篇 |
2011年 | 201篇 |
2010年 | 136篇 |
2009年 | 242篇 |
2008年 | 173篇 |
2007年 | 233篇 |
2006年 | 184篇 |
2005年 | 122篇 |
2004年 | 93篇 |
2003年 | 86篇 |
2002年 | 92篇 |
2001年 | 125篇 |
2000年 | 93篇 |
1999年 | 77篇 |
1998年 | 78篇 |
1997年 | 68篇 |
1996年 | 56篇 |
1995年 | 44篇 |
1994年 | 16篇 |
1993年 | 17篇 |
1992年 | 15篇 |
1991年 | 12篇 |
1990年 | 9篇 |
1989年 | 14篇 |
1988年 | 8篇 |
1987年 | 2篇 |
1986年 | 7篇 |
1985年 | 53篇 |
1984年 | 49篇 |
1983年 | 19篇 |
1982年 | 41篇 |
1981年 | 33篇 |
1980年 | 24篇 |
1979年 | 16篇 |
1978年 | 5篇 |
排序方式: 共有3158条查询结果,搜索用时 266 毫秒
101.
Arne Pfeilsticker 《Fuzzy Sets and Systems》1981,6(3):209-233
Ideas are presented to show how fuzzy mathematics can be applied in macro-economics in combination with the systems approach in order to bridge the gap between mathematical and language-oriented economists.Two reasons are given.From a mathematical point of view, fuzzy sets, fuzzy relations and fuzzy logic are not fuzzy at all. They are all well defined, but tend to be more complicated than traditional, mathematical concepts used in economics.From a language-oriented economist's point of view, fuzzy sets, etc. are used to express mathematically the type of concepts which are typical in language and most valuable in dealing with complex systems like an economy.The paper deals with economics in general terms, but examples are provided to illustrate the ideas. 相似文献
102.
We apply the theory of fuzzy subsets to the multiple objective decision problem of stock selection. We allow our objectives to have varying degrees of importance. We discuss various criteria used in selecting stocks. We indicate some procedures for subjectively evaluating the membership functions associated with these criteria. 相似文献
103.
104.
P.E Kloeden 《Fuzzy Sets and Systems》1982,7(3):275-296
A fuzzy dynamical system on an underlying complete, locally compact metric state space X is defined axiomatically in terms of a fuzzy attainability set mapping on X. This definition includes as special cases crisp single and multivalued dynamical systems on X. It is shown that the support of such a fuzzy dynamical system on X is a crisp multivalued dynamical system on X, and that such a fuzzy dynamical system can be considered as a crisp dynamical system on a state space of nonempty compact fuzzy subsets of X. In addition fuzzy trajectories are defined, their existence established and various properties investigated. 相似文献
105.
Non-dual fuzzy connections 总被引:1,自引:0,他引:1
The lack of double negation and de Morgan properties makes fuzzy logic unsymmetrical. This is the reason why fuzzy versions of notions like closure operator or Galois connection deserve attention for both antiotone and isotone cases, these two cases not being dual. This paper offers them attention, comming to the following conclusions: – some kind of hardly describable local preduality still makes possible important parallel results; – interesting new concepts besides antitone and isotone ones (like, for instance, conjugated pair), that were classically reducible to the first, gain independency in fuzzy setting. 相似文献
106.
In this paper, we introduce and study the signed fuzzy-valued measure and using the representation theorem of fuzzy numbers, we establish the Radon-Nikodym theorem for fuzzy-valued measurable functions with respect to fuzzy-valued measures.AMS Subject Classification (2000): 28E10, 04A72The research of this work is supposed by a grant of the education committee of Liaoning Province, China #20161049 相似文献
107.
1. IntroductionIt is a useful and challenging task to find efficient algorithms for many computationalhard problems. Recently, the research on Fixed-Parameter nactable Theory arouses muchinterest. FOr example, different fixed- p ax amet er- t rac t ab le- algori t hms for many well- knowndecisio11 pruble11ls illc1udi11g 3-dimellsio11al IIlatchiIlg: a11d vertex--cover Problen1 have beenPrese11ted in [1 8]. Jia11er Chen, DoIlald K. FYiesen al1d Weijia Jia proPosed a coll1pletelynew appro… 相似文献
108.
复模糊数是模糊复分析中的基本概念,在模糊复分析中,它的运算是基于扩张原理的形式给出的,是对元素遍历某个条件所对应的结果进行运算,这种遍历过程给实际操作带来了很多的不便,因此,在一定程度上也阻碍了模糊复分析理论的应用.对此,本文基于模糊结构元的理论基础,探讨了复模糊数运算的另一种新的途径,这种方法简化了复模糊数的运算,也... 相似文献
109.
To get a true hybrid framework for taking operational decisions from data, we extend the Algorithmic Inference approach to the Granular Computing paradigm. The key idea is that whether or not we need to make decisions instead of mere computations depends on the fact that collected data are not sufficiently definite; rather, they are representative of whole sets of data that could be virtually observed, and we need to manage this indeterminacy. The distinguishing feature is that we face indeterminacy exactly where it affects the quality of the decision. This gives rise to a family of inference algorithms which can be tailored to many specific decisional problems that are generally solved only in approximate ways. In the paper we discuss the bases of the paradigm and provide some examples of its implementation. 相似文献
110.
On the resolution and optimization of a system of fuzzy relational equations with sup-T composition 总被引:3,自引:2,他引:1
This paper provides a thorough investigation on the resolution of a finite system of fuzzy relational equations with sup-T composition, where T is a continuous triangular norm. When such a system is consistent, although we know that the solution set can be characterized
by a maximum solution and finitely many minimal solutions, it is still a challenging task to find all minimal solutions in
an efficient manner. Using the representation theorem of continuous triangular norms, we show that the systems of sup-T equations can be divided into two categories depending on the involved triangular norm. When the triangular norm is Archimedean,
the minimal solutions correspond one-to-one to the irredundant coverings of a set covering problem. When it is non-Archimedean, they only correspond to a subset of constrained irredundant coverings of a set covering problem. We then show that the problem of minimizing a linear objective function subject to a system of sup-T equations can be reduced into a 0–1 integer programming problem in polynomial time. This work generalizes most, if not all,
known results and provides a unified framework to deal with the problem of resolution and optimization of a system of sup-T equations. Further generalizations and related issues are also included for discussion. 相似文献